Integral trees with given nullity
نویسندگان
چکیده
منابع مشابه
Integral trees with given nullity
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with nullity 2 and 3 are unique.
متن کاملCounting labelled trees with given indegree sequence
For a labelled tree on the vertex set [n] := {1, 2, . . . , n}, define the direction of each edge ij to be i → j if i < j. The indegree sequence of T can be considered as a partition λ ⊢ n − 1. The enumeration of trees with a given indegree sequence arises in counting secant planes of curves in projective spaces. Recently Ethan Cotterill conjectured a formula for the number of trees on [n] with...
متن کاملOn the nullity of line graphs of trees
The spectrum of a graph G is the set of eigenvalues of the 0–1 adjacency matrix of G. The nullity of a graph is the number of zeros in its spectrum. It is shown that the nullity of the line graph of a tree is at most one. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملEla on the Characterization of Graphs with Pendent Vertices and given Nullity∗
Let G be a graph with n vertices. The nullity of G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the graphs (resp. bipartite graphs) with pendent vertices and nullity η, where 0 < η ≤ n. Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extrem...
متن کاملOn the characterization of graphs with pendent vertices and given nullity
Let G be a graph with n vertices. The nullity of G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the graphs (resp. bipartite graphs) with pendent vertices and nullity η, where 0 < η ≤ n. Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extrem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.08.007